Approximation algorithms for hard capacitated k-facility location problems
نویسندگان
چکیده
منابع مشابه
Approximation algorithms for the capacitated k-facility location problems
We study the capacitated k-facility location problem, in which we are given a set of clients with demands, a set of facilities with capacities and a constant number k. It costs fi to open facility i, and cij for facility i to serve one unit of demand from client j. The objective is to open at most k facilities serving all the demands and satisfying the capacity constraints while minimizing the ...
متن کاملApproximation algorithm for k-level hard capacitated facility location problem
In this paper, we consider k-level hard capacitated facility location problem.
متن کاملImproved Approximation Algorithms for Capacitated Facility Location Problems
In a surprising result, Korupolu, Plaxton, and Rajaraman [13] showed that a simple local search heuristic for the capacitated facility location problem (CFLP) in which the service costs obey the triangle inequality produces a solution in polynomial time which is within a factor of 8+ ǫ of the value of an optimal solution. By simplifying their analysis, we are able to show that the same heuristi...
متن کاملApproximation Algorithms for Soft-Capacitated Connected Facility Location Problems
1 Abbreviations and Notations 2
متن کاملBi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems
In the classical k-median problem the goal is to select a subset of at most k facilities in order to minimize the total cost of opened facilities and established connections between clients and opened facilities. We consider the capacitated version of the problem, where a single facility may only serve a limited number of clients. We construct approximation algorithms slightly violating the cap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2015
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2014.10.011